Numerical analysis of shell-based geometric image inpainting algorithms and their semi-implicit extension
نویسندگان
چکیده
In this paper we study a class of fast geometric image inpainting methods based on the idea of filling the inpainting domain in successive shells from its boundary inwards. Image pixels are filled by assigning them a color equal to a weighted average of their already filled neighbors. However, there is flexibility in terms of the order in which pixels are filled, the weights used for averaging, and the neighborhood that is averaged over. Varying these degrees of freedom leads to different algorithms, and indeed the literature contains several methods falling into this general class. All of them are very fast, but at the same time all of them leave undesirable artifacts such as “kinking” (bending) or blurring of extrapolated isophotes. Our objective in this paper is to build a theoretical model, based on a continuum limit and a connection to stopped random walks, in order to understand why these artifacts occur and what, if anything, can be done about them. At the same time, we consider a semi-implicit extension in which pixels in a given shell are solved for simultaneously by solving a linear system. We prove (within CBS acknowledges support from the Leverhulme Trust project Breaking the non-convexity barrier, the EPSRC grant EP/M00483X/1, EPSRC centre EP/N014588/1, the Cantab Capital Institute for the Mathematics of Information, the CHiPS (Horizon 2020 RISE project grant), the Global Alliance project ’Statistical and Mathematical Theory of Imaging’ and the Alan Turing Institute. RH and TH acknowledge support from the EPSRC Cambridge Centre for Analysis and the Cambridge Trust. L. Robert Hocking Department for Applied Mathematics and Theoretical Physics, University of Cambridge, Cambridge CB3 0WA, UK Tel.: +44 1223 764284 E-mail: [email protected] Thomas Holding Mathematics Institute, Zeeman Building, University of Warwick, Coventry CV4 7AL Tel.: +44 (0)24 765 73495 E-mail: [email protected] Carola-Bibiane Schönlieb Department for Applied Mathematics and Theoretical Physics, University of Cambridge, Cambridge CB3 0WA, UK Tel.: +44 1223 764251 E-mail: [email protected] ar X iv :1 70 7. 09 71 3v 1 [ m at h. N A ] 3 1 Ju l 2 01 7 2 L. Robert Hocking, Thomas Holding, and Carola-Bibiane Schönlieb the continuum limit) that this extension is able to completely eliminate kinking artifacts, which we also prove must always be present in the direct method. Although our analysis makes the strong assumption of a square inpainting domain, it makes weak smoothness assumptions and is thus applicable to the low regularity inherent in images.
منابع مشابه
فشردهسازی تصویر با کمک حذف و کدگذاری هوشمندانه اطلاعات تصویر و بازسازی آن با استفاده از الگوریتم های ترمیم تصویر
Compression can be done by lossy or lossless methods. The lossy methods have been used more widely than the lossless compression. Although, many methods for image compression have been proposed yet, the methods using intelligent skipping proper to the visual models has not been considered in the literature. Image inpainting refers to the application of sophisticated algorithms to replace lost o...
متن کاملVariational and PDE-based methods for big data analysis, classification and image processing using graphs
OF THE DISSERTATION Variational and PDE-based methods for big data analysis, classification and image processing using graphs by Ekaterina Merkurjev Doctor of Philosophy in Mathematics University of California, Los Angeles, 2015 Professor Andrea Bertozzi, Chair We present several graph-based algorithms for image processing and classification of highdimensional data. The first (semi-supervised) ...
متن کاملVariational Image Inpainting
Inpainting is an image interpolation problem, with broad applications in image and vision analysis. This paper presents our recent efforts in developing inpainting models based on the Bayesian and variational principles. We discuss several geometric image models, their role in the construction of variational inpainting models, and the associated Euler-Lagrange PDEs and their numerical computation.
متن کاملOn geometric variational models for inpainting surface holes
Geometric approaches for filling-in surface holes are introduced and studied in this paper. The basic idea is to represent the surface of interest in implicit form, and fill-in the holes with a scalar, or systems of, geometric partial differential equations, often derived from optimization principles. These equations include a system for the joint interpolation of scalar and vector fields, a La...
متن کاملChannel Luminosity (pb −1) Final Variable Reference
Inpainting is an image interpolation problem, with broad applications in image and vision analysis. This paper presents our recent efforts in developing inpainting models based on the Bayesian and variational principles. We discuss several geometric image models, their role in the construction of variational in-painting models, and the associated Euler-Lagrange PDEs and their numerical computat...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1707.09713 شماره
صفحات -
تاریخ انتشار 2017